Computing the topological type, or homology, of a given a simplicial complex is straight forward, but not always computationally feasible. The bottleneck is in computing the Smith Normal Form, which is a polynomial time algorithm [Kannan-Bachem], but still too slow on large examples (about cubic). Discrete Morse theory [Whitehead, Forman] provides a tool set which … Continue reading Random_Discrete_Morse